An algebraic view of the relation between largest common subtrees and smallest common supertrees
نویسندگان
چکیده
The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common subtree of two trees from a smallest common supertree of them, and vice versa. These constructions are the same for isomorphic, homeomorphic, topological, and minor embeddings, they take only time linear in the size of the trees, and they turn out to have a clear algebraic meaning.
منابع مشابه
Stochastic and Dependence Comparisons Between Extreme Order Statistics in the Case of Proportional Reversed Hazard Model
Independent random variables $Y_{1},ldots ,Y_{n}$ belongs to the proportional reversed hazard rate (PRHR) model with proportionality parameters $lambda_1,...,lambda_n$, if $Y_{k}sim G^{lambda _{k}}(x)$, for $k=1,...,n$, where $G$ is an absolutely continuous distribution function. In this paper we compare the smallest order statistics, the sample ranges and th...
متن کاملMaximum agreement and compatible supertrees
Given a collection of trees on leaves with identical leaf set, the MAST, resp. MCT, problem consists in finding a largest subset of the leaves such that all input trees restricted to this set are identical, resp. have a common refinement. For MAST, resp. MCT, on rooted trees, we give an algorithm, where and is the smallest number of leaves whose removal leads to the existence of an agreement su...
متن کاملA Strong Regular Relation on ?-Semihyperrings
The concept of algebraic hyperstructures introduced by Marty as a generalization of ordinary algebraic structures. In an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. The concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyperrings and a generalizat...
متن کاملOn the Approximation of Largest Common Subtrees and Largest Common Point Sets
This paper considers the approximability of the largest common subtree and the largest common subgraph problems, which have applications in molecular biology. It is shown that approximating the problems within a factor of n is NP-complete, while a general search algorithm which approximates both problems within a factor of O(n= logn) is presented. Moreover, several variants of the largest commo...
متن کاملPnm-8: Common Cause of Infertility in Infertile Women at Razavi Hospital Infertility Clinic
Background: Infertility therefore affects approximately 10-15% of couples and is an important part of practice of many clinicians .the most important factor of infertility include: male factor(40%) female factor ( 40%) , both of them (10%) and unexplained infertility (10%).The purpose of this study is evaluation of the cause of infertility in patients who are referred to Razavi hospital inferti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 362 شماره
صفحات -
تاریخ انتشار 2006